Apparatus, and associated method, for paging a mobile station

ABSTRACT

An apparatus, and an associated methodology, for facilitating paging of a mobile station pursuant to a two-step paging procedure. A unique identifier of the mobile station that is to be paged is hashed into a first group of hashed values and at least a second group of hashed values. The first group of hashed values are used by page message generator to generate a page on a first paging channel. And, the second group of values are used by a page message generator to generate a page on a second paging channel. All of the bits of the unique identifier are sent to page the mobile station. The mobile station determines therefrom whether the mobile station has been paged.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No.11/971,744 filed on Jan. 9, 2008, the contents of which are incorporatedherein by reference.

The present disclosure relates generally to a manner by which tofacilitate paging of a mobile station. More particularly, the presentdisclosure relates to an apparatus, and an associated methodology, bywhich to page the mobile station pursuant to a two-stage paging scheme.

Bits that together uniquely identify the mobile station, such as a TMSI(Temporary Mobile Station Identity) address or IMSI (InternationalMobile Subscriber Identity) address are hashed into paging messages thatare sent on first and second paging channels. The hashing of the bitsinto messages on the separate paging channels is carried out in a mannerin which the size of a paging message sent on a second of the pagingmessage channels is of reduced length, permitting the second pagingmessage channel to be used for additional communication purposes.

BACKGROUND OF THE INVENTION

Advancements in communication technologies have been implemented in manyvaried types of communication systems. Their implementation haspermitted the improved communication capacities of existingcommunication systems and the introduction of communication systems.Cellular, and cellular-like, mobile communication systems are exemplaryof communication systems made possible as a result of advancements incommunication technologies.

Successive generations of cellular communication systems have beendeveloped and deployed with each generation taking advantage ofavailable communication technologies. While early-generationcommunication systems provided primarily voice communication servicesand only limited data communication services, newer-generation systemsprovide increased data services. Cellular mobile radio communicationsystems are, as a result, increasingly used, not just for voiceservices, but also for data communication services.

A user typically communicates by way of a cellular communication systemthrough use of a mobile station. A mobile station is a radiotransceiver, typically of dimensions permitting its convenient carriageand operation by the user. The mobile station is powered by a portablepower supply that is carried together with, and forms part of, themobile station. During operation of the mobile station, the storedenergy of the portable power supply is depleted, and the power supplymust be recharged or replaced once the stored energy is depleted to anextent that limits, or prevents, the continued operation of the mobilestation. To increase the operational period of a mobile station, effortsare made to reduce its energy requirements.

Schemes have been developed, relating to monitoring, by a mobilestation, for a pending communication service. A mobile station ismaintained in a low-power, sometimes referred to as a sleep mode, andthe mobile station periodically wakes up to monitor a paging channel todetermine whether the mobile station is paged. If the mobile station isnot paged, the mobile station returns to a sleep, or other low-power,mode, thereby to minimize power dissipation. The page of the mobilestation must appropriately identify the mobile station so that themobile station is aware that it, and not a different mobile station, isbeing paged. At least one proposed system provides for a two-stagepaging scheme in which two different channels are used to send a page topage a mobile station. The 3GPP (3^(rd) Generation Partnership Project)is considering proposals for a new air interface, referred to as LongTerm Evolution (LTE). In the proposed paging scheme, the mobile station,referred to as a UE (User Equipment), wakes up and monitors a firstchannel. Assignment information, if sent thereon, provides informationusable by the UE to then tune to the second paging channel. Proposalsprovide for the communication on the first paging channel of a groupaddress, referred to as a PI-RNTI. More than one UE might share the sameaddress. Any UE that detects the group address communicated on the firstpaging channel then also monitors the second paging channel for a pagemessage sent thereon. In one existing proposal, a unique identifier,such as a 32-bit TMSI (Temporary Mobile Station Identity), is sent onthe second paging channel to page the mobile station. Because the uniqueidentifier uniquely identifies the UE, only the UE that is intended tobe paged is paged by the transmission. The second paging channel is,however, also used for traffic services, such as the communication ofvoice traffic or data traffic. The use of a lengthy, unique identifierto identify the UE that is paged therefore comes at the expense ofcapacity on the channel also to be used for a traffic service.

If a manner could be provided by which to reduce the lengths of pagingmessages sent on the second paging channel, additional system capacitywould be made available for communication pursuant to a traffic service.

It is in light of this background information related to paging of amobile station in a radio communication system that the significantimprovements of the present disclosure have evolved.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a functional block diagram of a radio communicationsystem in which an embodiment of the present disclosure is operable.

FIG. 2 illustrates a representation of an exemplary allocation of firstand second paging channels during four successive sub frame timeperiods.

FIG. 3 illustrates exemplary hashing performed during operation of anembodiment of the present disclosure.

FIG. 4 illustrates a representation, similar to that shown in FIG. 3,but here showing alternate hashing performed pursuant to operation of analternate embodiment of the present disclosure.

FIG. 5 illustrates another representation, similar to those shown inFIGS. 3-4, but representative of alternate hashing performed pursuant toanother alternate embodiment of the present disclosure.

FIG. 6 illustrates an exemplary message format of an exemplary messagegenerated pursuant to operation of the radio communication system shownin FIG. 1 of an embodiment of the present disclosure.

FIG. 7 illustrates a representation, similar to that shown in FIG. 6,but of an alternate message generated pursuant to an alternateembodiment of the present disclosure.

FIG. 8 illustrates a representation of another exemplary messagegenerated pursuant to operation of an embodiment of the presentdisclosure.

FIG. 9 illustrates a process diagram representative of the process of anexemplary embodiment of the present disclosure.

FIG. 10 illustrates a message sequence diagram representative of themethod of operation of an embodiment of the present disclosure.

DETAILED DESCRIPTION

The present disclosure, accordingly, advantageously provides apparatus,and an associated methodology, by which to facilitate paging of a mobilestation.

Through operation of an embodiment of the present disclosure, a manneris provided by which to page the mobile station pursuant to a two-stagepaging scheme.

In one aspect of the present disclosure, the bits that are sent,pursuant to the two-page paging scheme, together include all of the bitsthat uniquely define the mobile station that is paged. The bits that aresent together define, for instance, a TMSI, an IMSI, or other value thatuniquely identifies the mobile station. Thereby, through appropriaterecombination of the bits that are sent pursuant to the two-stage pagingscheme, the mobile station is able to recreate the unique identifierthat is sent and to determine whether the mobile station is paged.

In another aspect of the present disclosure, the unique identifier thatuniquely identifies a mobile station that is to be paged is hashed tohash a first group of bits of the identifier to a first paging messageand to hash a second group of the bits of the identifier to a secondpaging message. Multiple noncontiguous portions of the identifier arehashed to form the separate paging messages. Because noncontiguousportions of the unique identifier are used in the hashing, problems thatmight otherwise result from the use of contiguously-positioned bits ofthe unique identifier are avoided.

In another aspect of the present disclosure, when implemented in a 3GPPLTE system, the hashings that form the first group of hashed bits form agroup address, a PI-RNTI value. And, the hashed bits that form thesecond group form a short address. The group address is sent on a firstchannel, e.g., a DL-CCH (Down Link Control Channel), and the secondgroup is sent on a PCH (Paging Channel). The first group and the secondgroup together comprise all of the unique identifiers that uniquelyidentify the mobile station. If the unique identifier is 32 bits, e.g.,the first group comprises, e.g., 16 bits, and the second group comprisesthe remaining 16 bits.

In another aspect of the present disclosure, the hashing of the uniqueidentifier of the mobile station is performed to create three groups ofthe bits hashed from the identifier. A first group of hashed bits formsthe group address, a second group forms a short address, and a thirdgroup forms a third address. The number of hashed bits of the threegroups together correspond to the bits of the unique identifier.

In another aspect of the present disclosure, a single group address isused for all mobile stations. And, the group address is set to a valuethat is the same for all individually directed pages, e.g., the groupaddress is set to be 0xffff. The unique identifier of the mobile stationis hashed to form a first short address and a second address.

In another aspect of the present disclosure, the mobile station wakes upto detect whether the group address associated therewith is sent on afirst paging channel, such as a DL-CCH. And, the mobile station furthermonitors the second paging channel to detect whether a short address iscommunicated thereto.

In another aspect of the present invention, the mobile station combinesthe bits detected on the two paging channels and determines whether themobile station has been paged by determining whether the combined bitscorrespond to the bits of the unique identifier of the mobile station.

Because fewer than all of the bits of the unique identifier are sent onthe second paging channel, additional capacity is provided on the secondpaging channel for the performance of traffic communication services.Improved efficiency of use of spectrum allocated to the communicationsystem.

In these and other aspects, therefore, an apparatus, and an associatedmethodology, is provided for facilitating mobile-station paging upon afirst paging channel and a second paging channel. A hasher is configuredto hash a unique mobile station identifier into a first group of bitsand a second group of bits. A page message generator is configured togenerate a first page message that contains the first group of bits onthe first paging channel and to generate a second page message thatcontains the second group of bits on the second paging channel.

Referring first, therefore, to FIG. 1, a radio communication system,shown generally at 10, provides for radio communications with mobilestations, of which the mobile station 12 is representative. Thecommunication system, in the exemplary implementation, forms a 3GPP(3^(rd) Generation Partnership Project) LTE (Long Term Evolution) systemthat provides for both voice and data communication services by, andwith, mobile stations, such as the mobile station 12. When acommunication service is to be established with a mobile station, themobile station is paged in order to alert the mobile station of thepending communication service and thereby to permit the mobile stationto take further action to accept the communication service and enterinto a state to permit its delivery or performance. As mentionedpreviously, a two-stage paging method is to be provided. That is to say,when paging a mobile station, hereinafter referred to as a UE (UserEquipment) the infrastructure uses two different channels to send apage. Page messages, originated at the network 14, are sent uponchannels defined upon a radio air interface that extends beyond thenetwork 14 and the mobile stations. While the following descriptionshall describe exemplary operation in which the communication systemforms a 3GPP LTE system, the teachings set forth herein are analogouslyimplementable in other types of communication systems.

Pursuant to paging in the 3GPP LTE-compliant system, the UE is assignedto a certain paging occasion within a DRX (Discontinuous Reception)cycle. The UE 12 wakes up and turns on its receiver and first receives acontrol channel, referred to as an L1/L2 control channel, a PD-CCH(Physical Downlink Control Channel), or a Downlink Control Channel(DL-CCH). The DL-CCH includes resource block assignment information. Theresource block assignment includes, e.g., information such as thefrequency and time to indicate to the UE in what manner to receive theassociated paging message. Then, the paging message is sent on a PCH(Paging Channel) transport channel. The PCH transport channel is mappedto a PDSCH (Physical Downlink Shared Channel) physical channel.

A group address is used on the DL-CCH. The group address is sometimesreferred to as a PI-RNTI. When paging a UE, the network is aware of thePI-RNTI of the UE that is to be paged, and the network uses the addressto form the content of the DL-CCH message. In 3GPP specification number36.212v200, a 16-bit cyclic redundancy check (CRC) is used for errordetection of the DL-CCH. This section also specifies that, for theDL-CCH message, an exclusive OR operation is performed on the computedCRC, and an identity, i.e., the PI-RNTI. The result of the exclusive ORoperation is appended to the payload. Then both the PI-RNTI and theresult of the exclusive OR operation are sent on the DL-CCH. Due to theexclusive OR operation, a UE that receives the transmitted message isnot able to decode the content that is intended for another UE that hasanother PI-RNTI.

The DL-CCH is represented by the arrow 18, and the PCH is represented bythe arrow 22. The channels are defined upon the radio air interface andare monitored by the UE 12 in manners as noted above. As also notedabove, the PCH is also used for traffic services to communicate voiceand data traffic. An embodiment of the present disclosure provides amanner by which to increase the portion of the PCH that is available forcommunication of traffic data.

An apparatus 28 is embodied at a network entity, here a base transceiverstation 34 and operates pursuant to paging of a UE, here the UE 12. Theapparatus 28 includes a hasher 32 and a page message generator 36. Theelements 32 and 36 are functionally represented, implementable in anydesired manner, including algorithms executable by processing circuitry.And, while the apparatus is here shown to be embodied at a singlenetwork entity, in other representations, the elements are distributedamongst more than one entity.

When a communication service is to be performed with the UE 12, itsunique identifier, here a TMSI, a 32-bit value, that uniquely identifiesthe UE is provided to the hasher 32. The hasher 32 operates to hash thebits of the TMSI, or other unique identifier, into groups of hashedbits. The groups of hashed bits are provided to the page messagegenerator 36. The page message generator 36 forms a first message fortransmission upon the DL-CCH and, thereafter, a second message that issent upon the PCH. The hashing is performed in a manner such that,collectively, all of the bits of the TMSI, or other unique identifier,are used in the first and second page messages.

The UE 12 includes further apparatus, shown at 38 of an embodiment ofthe present disclosure. The apparatus 38 is also functionallyrepresented, formed of entities implementable in any desired manner,including by algorithms executable by processing circuitry. Theapparatus includes a first detector 42, a second detector 44, a combiner48, and a determiner 52. The UE is further shown to include transceivercircuitry, here represented by a receive (RX) part 56 and a transmit(TX) part 58.

The first detector 42 operates to detect a page message sent on thefirst paging channel, here the DL-CCH 18. When a page message is sent onthe DL-CCH 18 and delivered to the mobile station 12, the detector 42detects its contents, provides the detected contents to the combiner 48,and provides an indication to the detector 44 to monitor for thecommunication of a page message on the paging channel 22. When a pagingmessage is subsequently sent on the paging channel and delivered to themobile station, the detector detects its delivery and provides thedetected contents of the page message to the combiner 48.

The combiner operates to combine the bits provided thereto by thedetectors 42 and 44. If the combination corresponds with the uniqueidentifier of the mobile station, a determination is made by thedeterminer that the mobile station is being paged. In anotherimplementation, the bits are not combined but, rather, are compared withcorresponding values of the unique identifier. Lines 62 and 64 extendingto the receive and transmit parts, respectively, of the mobile station,alert the transceiver circuitry to enter into a state pursuant toperformance of the communication service.

FIG. 2 illustrates a representation, shown generally at 72, of exemplarypaging in a 3GPP LTE radio air interface. Here, the first four 1 ms subframes 74 of a 10 ms frame are shown. Each sub frame 74 includesmultiple DL-CCH channels, and messages sent thereon, followed by one ormore pages generated on one or more paging channels.

In the first sub frame, four DL-CCHs 76, 78, 82 and 84 are shown. Eachof the DL-CCHs is defined upon different OFDM sub carrier frequencies.The channels 76 and 78 here send assignment information that direct UEsto receiver their pages in a first PCH page message 86. The channels 82and 84 here send assignment information directing UEs to receive theirpages sent on a second PCH 88. Messages sent on the channels 86 and 88are transmitted using different OFDM sub carrier frequencies.

The second sub frame 74 illustrates DL-CCHs 92 and 94. Messagesgenerated on each of these two channels are transmitted using differentOFDM sub carrier frequencies. The channel 92 has assignment informationthat directs a UE to receive its page on the PCH 96. The channel 94 hasassignment information that directs a UE to receive its page on the PCH98. The page messages 96 and 98 are transmitted using different OFDM subcarrier frequencies. A page message sent on the channel 96 is sent on adifferent set of OFDM sub carrier frequencies than those used by thechannel 92. Likewise, the page message sent on the channel 98 is sent ona different set of OFDM sub carrier frequencies than the frequenciesused by the channel 94.

The third sub frame 74 shows four DL-CCHs, 102, 104, 106, and 108. Eachof the four channels is defined upon different OFDM sub carrierfrequencies. Messages sent thereon all have assignment informationdirecting UEs to receive their pages on a paging channel 112. The pagemessage sent on the paging channel 112 is sent on a different set of subcarrier frequencies than those upon which any of the channels 102-108are defined.

In the fourth sub frame 74, two DL-CCHs 116 and 118 are defined.Messages broadcast thereon both have assignment information directingUEs to receive their pages on a paging channel 122. The page messagesent on the paging channel 122 is sent on a different set of sub carrierfrequencies than those that define either of the channels 116 or 118.

FIG. 3 illustrates a representation 132 representative of exemplaryhashing performed pursuant to an embodiment of the present disclosure.Here, a 32-bit TMSI address 134 is hashed into two groups of hashedvalues 136 and 138. The first group 136 defines a 16-bit PI-RNTI value,and the second group 138 defines a 16-bit PCH address. The PCH addressis a short address that is used as a PCH page message. Hashing isperformed to page the UE that is associated with the unique identifier134.

In the scheme represented in FIG. 3, all of the bits of the TMSI aredivided between the groups 136 and 138 such that all of the TMSI bitsare used for paging. The PI-RNTI 136 is formed of 16 of the TMSI bits.In other implementation, the PI-RNTI, or equivalent, is of otherlengths, e.g., 14 bits, 12 bits, etc. And, an address to be used on thePCH is formed of the other 16 of the TMSI bits.

TMSI assignment is performed by a core network, and the radio accessnetwork portion of the network does not have control over the TMSIassignment procedure. If the core network assigned TMSIs that wererandom in all 32 bits, then the mapping of the 32 TMSI bits to thegroups 136 and 138 would not require hashing. If, for example, thePI-RNTI could be set to the most significant bits of the TMSI, and the16 bit short page address was set to the least significant bits of theTMSI, the randomness would carry over to the groups of bits. However,the bits of the TMSI may not be randomly assigned. According to a simpleTMSI assignment procedure, the core network could simply assign TMSIssequentially. In this scenario, if there were a number of UEs then allUEs would have the same PI-RNTI values, thus forcing all UEs monitoringa sub frame to monitor all PCH page messages. Battery life of the UEwould be reduced.

Hashing in accordance to the representation 132 avoids this problem byassigning the PI-RNTI such that it is not simply a contiguous portion ofthe TMSI, and likewise assigning the short page address such that it isnot simply a contiguous portion of the TMSI. The PI-RNTI is set, asshown, to the concatenation of multiple non-contiguous portions of theTMSI. Likewise, the short page address 138 is set to the concatenationof multiple non-contiguous portions of the TMSI. In this scheme, themultiple non-contiguous portions of the TMSI used to form the PI-RNTIand the short page address are all one-bit, non-contiguous portions.Alternately, some or all of the non-contiguous portions could bemulti-bit, non-contiguous portions. As illustrated, the TMSI is formedof 32 bits A-f. A is the most significant bit and f is the leastsignificant bit. The PI-RNTI 136 is formed by concatenating the evenbits B . . . f of the TMSI together. The short page address 138 isformed by concatenating the odd bits A . . . e of the TMSI together.Many variations of the scheme shown in the representation 132 are, ofcourse, possible.

One of the benefits provided by the scheme of the representation 132 isthat all bits of the unique identifier are together used on the DL-CCHand the PCH. Some of the address bits are used on the DL-CCH andremaining ones of the address bits are used on the PCH. By using all ofthe bits to page the UE rather than a subset of the bits, any issuesassociated with having two UEs responding to the same page are avoided.

It should be noted that, while the exemplary representation utilizes aTMSI, in other implementations, other identifiers are used, e.g., anIMSI address or a hardware identifier. In one implementation theinfrastructure and UE could use a first type of address such as an IMEIon both the DL-CCH and the PCH if there is no TMSI assigned to the UE;the infrastructure and the UE would then use a second type of addresssuch as a TMSI on both the DL-CCH and the PCH if a TMSI is assigned tothe UE.

FIG. 4 illustrates a representation 142 of another hashing schemeutilized pursuant to an embodiment of the present disclosure. Here, the32-bit TMSI, or other unique identifier, 144 of a UE is hashed intothree groups, a first hashed group 145, a second hashed group 146, and athird hashed group 148. The first group 145 again forms a 16-bitPI-RNTI. The second group 146 forms a 6-bit short address to be used ina PCH page message. And, the third group 148 forms a 10-bit DL-CCHaddress. In 3GPP, the final format for the DL-CCH is not yet formulated.However, it appears that, when used for paging, there may be as many as11 bits from the DL-CCH payload that would be unused. It is contemplatedthat currently unused bits are able to be allocated to carry additionaladdress bits in order to further reduce the size of the address used onthe PCH and, thus, further save capacity on the PDSCH. When a UEreceives the DL-CCH and the CRC check passes, then the UE determinesthat the message is being sent, addressed to the PI-RNTI of the UE. TheUE then compares the received DL-CCH address to its own DL-CCH address.If the two match, then the UE attempts to receive a PCH page messagebased upon the received assignment information. It should be noted that,adding more address bits in addition to the PI-RNTI to the DL-CCH, theprobability that a UE shall receive the PCH page message in response toanother UE being paged is reduced. Considerably more energy is requiredto receive a PCH message, thus this implementation provides batterysavings. The hashing mechanism set forth in FIG. 4 is performed by thenetwork part in order to page a UE. Analogous hashing is performed atthe UE in order to receive a page. The hashing mechanism set forth inFIG. 4 divides all of the bits of the TMSI between the DL-CCH and thePCH page message such that all of the TMSI bits are used for paging. ThePI-RNTI is formed from 16 of the TMSI bits. The DL-CCH address is formedanother 10 bits of the TMSI. And an address to be used on the PCH isformed of the other 6 bits of the TMSI bits.

Although the scheme set forth in FIG. 4 shows that the short PCH addressis six bits and that the DL-CCH address is ten bits, it should be notedthat other bit lengths could be used for the DL-CCH address and for theshort PCH page address. In the event that there are fewer unused bitsavailable for paging on the DL-CCH than currently anticipated, then theDL-CCH address can be shortened and the short PCH address cancorrespondingly be lengthened. Alternatives include, e.g., a 7-bit,short PCH address with a 9-bit DL-CCH address, an 8-bit short PCHaddress with an 8-bit DL-CCH address, a 9-bit short PCH address with a7-bit DL-CCH address, an 10-bit short PCH address, with a 6-bit DL-CCHaddress, etc. Various combinations are used with the entire TMSI usedfor paging the UE on the DL-CCH and the PCH.

In the scheme set forth in FIG. 4, the PI-RNTI is assigned such that itis not simply a contiguous portion of the TMSI. And the DL-CCH addressis also assigned in a manner such that it is not simply a contiguousportion of the TMSI. And, also, the short page address is assigned suchthat it also is not a simply contiguous portion of the TMSI. Each of thegroups of bits is set to the concatenation of multiple non-contiguousportions of the TMSI. In the scheme shown in FIG. 4, all of the hashingis of 1-bit, non-contiguous portions. In alternate schemes, some, orall, of the non-contiguous portions are instead multi-bit,non-contiguous portions. Here, the PI-RNTI is formed by concatenatingthe even bits of the TMSI together. The DL-CCH address is formed byconcatenating a first group of odd bits and the short page address isformed by concatenating a second group of odd bits together. Manyvariations of the scheme shown by the representation 142 are possible.

A benefit associated with the hashing scheme of the representation 142is that all bits of the address 144 are used on the DL-CCH and the PCH.Some of the address bits are used on the DL-CCH, and the remainingaddress bits are sent on the PCH. By using all of the bits to page theUE instead of a subset of the bits, any issues associated with havingtwo UEs respond to the same page are avoided.

Here, again, while a TMSI address forms the identifier 144 in theexemplary implementation, in other implementations, other uniqueidentifiers, such as an IMSI or a hardware identifier are instead used.Again, in one implementation the infrastructure and UE could a firsttype of address such as an IMEI on both the DL-CCH and the PCH if thereis no TMSI assigned to the UE; the infrastructure and the UE would thenuse a second type of address such as a TMSI on both the DL-CCH and thePCH if a TMSI is assigned to the UE.

FIG. 5 illustrates a representation 152 of another hashing scheme usedpursuant to operation of another embodiment of the present disclosure.Here, again a 32-bit TMSI 154 is hashed into a first group of hashedbits 156 and a second group of hashed bits 158. In this scenario, it isassumed that a single PI-RNTI value 160 is used for individuallydirected pages to all UEs. That is to say, the same PI-RNTI 160 is usedto page all UEs. The PI-RNTI 160 is set to a value, such as, e.g.,0xffff or any other value. As the PI-RNTI is set to a fixed value forall individually directed pages, the PI-RNTI is not used to conveyaddress bits of the unique identifier of a UE. The scheme set forth inFIG. 5 shows an example of a manner by which to hash a 32-bit TMSIaddress 154 to a 22-bit short address 158 to be used in the PCH pagemessage, and a 10-bit, DL-CCH address 156. When a UE receives theDL-CCH-sent message, and the CRC check passes with the PI-RNTI 160, theUE determines that the DL-CCH message is part of anindividually-directed page. The UE then compares the received DL-CCHaddress to its own DL-CCH address. If the two match, then the UEattempts to receive a PCH page message based upon the receivedassignment information. The hashing mechanism represented in FIG. 5 isperformed at the network and a corresponding hashing procedure isperformed at the UE. Again, all of the bits of the TMSI 154 areincluded, collectively, in the group 156 and group 158. Again, while, inthe exemplary implementation, the first group 156 is of a 10-bit lengthand the second group 158 is of 22-bit length, in other implementations,the addresses 156 and 158 are formed of other lengths, analogous to thescenario set forth above with respect to FIGS. 3 and 4. Additionally,again, the hashing is performed in a manner such that multiple,non-contiguous portions of the TMSI are hashed and concatenatedtogether. In other implementations, multiple, non-contiguous portions ofthe TMSI are used to form the first and second groups 156 and 158. And,again, in other implementations, other values, other than the TMSI, suchan IMSI or other hardware identifier, is instead utilized and hashed.Again, in one implementation the infrastructure and UE could a firsttype of address such as an IMEI on both the DL-CCH and the PCH if thereis no TMSI assigned to the UE; the infrastructure and the UE would thenuse a second type of address such as a TMSI on both the DL-CCH and thePCH if a TMSI is assigned to the UE.

FIG. 6 illustrates an exemplary DL-CCH message, shown as 168, used foran individually directed page. The message includes a PCH assignmentinformation field 172, a PI-RNTI adjusted field 174, an otherinformation field 176, and an error detecting code field 178.

The PCH assignment information field 172 includes information to directa UE how to receive a PCH message. For example, with respect to theexample shown in FIG. 2, the information in the PCH assignmentinformation field of the channel 76 informs the UE of the PCH page 86.The information in the PCH assignment information field 172 wouldindicate which OFDM sub carrier frequencies are used for the PCH page.Additional information includes, e.g., items such as a time off setuntil the beginning of the PCH page or a timed duration of the PCH page.The field 174 indicates to the UE whether the PI-RNTI of the UE isadjusted in order to avoid a collision with a reserved PI-RNTI. Thefield 174 is used, e.g., to ensure that the UE is uniquely addressed.Alternately, the PI-RNTI adjusted field 174 is omitted if it is notimperative that the UE be addressed uniquely. The field 176 includesother information and consists, e.g., of reserved bits. The errordetecting field 178 is set to the PI-RNTI exclusive-ORed with a CRCcomputed over the fields of the message.

FIG. 7 illustrates another exemplary DL-CCH message, shown at 182, usedfor an individually-directed page. The message includes a PCH assignmentinformation field 184, a PI-RNTI adjusted field 186, a 10-bit DL-CCHaddress field 188, and an error detecting code field 192. The fields184-192 are analogous to those set forth above with respect to themessage 168 shown in FIG. 6.

The field 188 is used to carry more bits of the UE address andcorresponds to the address 148 shown in FIG. 4. Different types ofhashing, other than those set forth in FIG. 4 can be used to form thevalues of the field. And, lengths other than 10 bits can also be used.

FIG. 8 illustrates portion 196 of an exemplary PCH message that is usedto page two UEs. Fields present in an actual page message, such asheader bits, a message ID, and an error detecting code are not shown.The PCH page message is used to page at least one UE and can be used topage two or more UEs by including multiple page records in the message.The example shown in FIG. 8 shows two page records. The first pagerecord comprises an address format field 198, an address field 202, anda page info field 204. The second page record comprises an addressformat field 206, and address field 208, and a page info field 212.

The address format field 198 includes information about the addressfield 202. The address format field 198 is indicative of the length ofthe address field 202. In one embodiment, the address format field mayalso, specify the type of address if multiple types of address are usedfor paging. Possible address types include, e.g., a TMSI, an IMSI, and ahardware identifier. Alternately, the type of address could be specifiedby another field if multiple address types were supported. The addressformat field 198 may be a single-bit field if there is only one type ofaddress possible and only two possible lengths. Alternately, the addressformat field may be a multi-bit field. The address field 202 includeseither the UE identity or a hashed portion of the UE identity.

The page info field 204 includes information about the page. Thisinformation is, for example, the service that is causing the UE to bepaged. Knowing the service that caused the page can help the UE torequest set up of the appropriate resources when the UE responds to thepage. The page info field 204 may also include other information. Thefields 206-212 are analogous to the fields 198-204.

FIG. 9 illustrates a procedure 232 of an embodiment of the presentdisclosure by which a UE receives a page. Subsequent to the start at thestart block 234, the UE receives, indicated by the block 236, a DL-CCHmessage sent on a DL-CCH. As indicated by the block 238, the UE computesa CRC on the received DL-CCH payload bits. Exemplary payload bits areshown in the example message 182 shown in FIG. 7.

Processing continues, and a determination is made at the decision block242 at which the UE compares the computed CRC with the received errordetecting code, such as represented by the field 192 shown in FIG. 7,exclusive-ORed with the PI-RNTI of the UE. If the result of the decision242 is negative, processing continues at the block 244 where the UEignores the page and then ends at the block 246.

If, conversely, the result of the operation 242 is positive, the yesbranch is taken to the block 248. If there is no PI-RNTI adjusted field,then the operation 248 is not required. And, processing, instead,continues at the decision block 250 rather than the decision block 248.

At the step 248, the UE compares the PI-RNTI adjusted field from themessage with its own value. If the result of the determination isnegative, a path is taken to the block 244 where the UE ignores the pageand then ends at the end block 246.

If, conversely, a positive determination is made at the decision block248, processing continues at the decision block 250. The operation 250is optional if a DL-CCH address field is not included. If a DL-CCHaddress is not included, processing continues at the block 252 ratherthan at the decision block 250. At the step 250, the UE compares theDL-CCH address field from the message with its DL-CCH address. If theresult of the comparison is negative, processing continues at the block244. Conversely, if the result of the operation 250 is positive,processing continues at the block 252. At the function 252, the UEreceives the PCH page message to which it is directed by the DL-CCH.After the step 252, processing continues at the decision block 254.

At the decision block 254, the UE compares its own address bits toaddress bits from records of the page message. The UE determines thereto be a match if one of the address fields is the same as the UE'scorresponding bits. If the result of the comparison is negative, the nobranch is taken to the block 244. Otherwise, if the comparison ispositive, processing continues at the block 256 where the UE processesand responds to the page record of the message that had the matchingaddress bits. Processing ends at the end block 246.

FIG. 10 illustrates a method flow diagram, shown generally at 276,representative of the method of operation of an embodiment of thepresent disclosure. The method provides a procedure to send pages in aframe. The procedure starts at the start block 278.

At the block 282, the infrastructure determines the UEs to be paged. TheUE is paged, e.g., to inform the UE of an incoming phone call or inorder to deliver data to the UE pursuant to a data communicationservice.

Thereafter, and as indicated by the block 286, the addresses of the UEthat is being paged is hashed. If more than one UE is paged, each of theaddresses of each of the UEs is hashed. In one implementation, hashesare performed at an earlier time and the hashed values are stored insubsequently retrieved in substitution for the hashing of the operation286. Then, and as indicated by the block 288, a determination is madethat the DL-CCH content of the DL-CCHs in the frame. And, as indicatedby the block 292, a determination is made of the PCH content.

Then, as indicated by the block 294, the DL-CCH is sent. And, asindicated by the block 298, the PCH is sent. The operations 288-298 arerepeated if there are so many pages that multiple sub frames of a frameare required for the pages. Subsequent to the operation 298, the processends, indicated by the end block 300.

Presently preferred embodiments of the disclosure and many of itsimprovements and advantages have been described with a degree ofparticularity. The description is of preferred examples of implementingthe disclosure, and the description of preferred examples is notnecessarily intended to limit the scope of the disclosure. The scope ofthe disclosure is defined by the following claims.

1. An apparatus for facilitating mobile-station paging upon a firstpaging channel and a second paging channel, said apparatus comprising: ahasher configured to hash a unique mobile station identifier into afirst group of bits and a second group of bits; and a page messagegenerator configured to generate a first page message that contains thefirst group of bits on the first paging channel and to generate a secondpage message that contains the second group of bits on the second pagingchannel.
 2. The apparatus of claim 1 wherein the first group of bits andthe second group of bits together comprise all bits of the unique mobilestation identifier.
 3. The apparatus of claim 1 wherein the first groupof bits comprises first multiple non-contiguous portions of the uniquemobile station identifier.
 4. The apparatus of claim 1 wherein thesecond group of bits comprises second multiple non-contiguous portionsof the unique mobile station identifier.
 5. The apparatus of claim 1wherein the first group of bits comprises a first subgroup of the firstgroup and a second subgroup of the first group.
 6. The apparatus ofclaim 5 wherein the first subgroup comprises first non-contiguousportions of the unique mobile station identifier and wherein the secondsubgroup comprises second non-contiguous portions of the unique mobilestation identifier.
 7. The apparatus of claim 5 wherein the firstsubgroup comprises a group identifier and wherein the second subgroupcomprises a first paging channel address.
 8. The apparatus of claim 1wherein the first group of bits forms a first address.
 9. The apparatusof claim 8 wherein the second group of bits comprises a second address.10. A method for facilitating mobile-station paging upon a first pagingchannel and a second paging channel, said method comprising: hashing aunique mobile station identifier into a first group of bits and a secondgroup of bits; generating a first page message that contains the firstgroup of bits on the first paging channel; and generating a second pagemessage that contains the second group of bits on the second pagingchannel.
 11. The method of claim 10 wherein the first group of bits andthe second group of bits together comprise all bits of the unique mobilestation identifier.
 12. The method of claim 10 wherein the first groupof bits comprises first multiple non-contiguous portions of the uniquemobile station identifier and wherein the second group of bits comprisessecond multiple non-contiguous portions of the unique mobile stationidentifier.
 13. An apparatus for facilitating paging of a mobilestation, said apparatus comprising: a detector configured to detect afirst group of bits communicated on a first paging channel and to detecta second group of bits communicated on a second paging channel; and adeterminer configured to determine whether the mobile station is pagedresponsive to determination of whether the first group of bits and thesecond group of bits together correspond to a unique mobile stationidentifier.
 14. The apparatus of claim 13 wherein the first group ofbits and the second group of bits together comprise all bits of theunique mobile station identifier.
 15. The apparatus of claim 13 whereinthe first group of bits comprises first multiple non-contiguous portionsof the unique mobile station identifier and wherein the second group ofbits comprises second multiple non-contiguous portions of the uniquemobile station identifier.
 16. The apparatus of claim 13 furthercomprising a combiner configured to combine the first group of bits andthe second group of bits.
 17. The apparatus of claim 16 wherein saiddeterminer is further configured to hash a second subgroup of the secondgroup of bits to a second portion of the second locations of the uniquemobile station identifier field.
 18. A method for facilitating paging ofa mobile station, said method comprising: detecting a first group ofbits communicated on a first paging channel to first locations of aunique mobile station identifier field; detecting a second group of bitscommunicated on a second paging channel; and determining whether themobile station is paged responsive to determination of whether the firstgroup of bits and the second group of bits together correspond to aunique mobile station identifier.
 19. The method of claim 18 wherein thefirst group of bits and the second group of bits together comprise allvalues of the unique mobile station identifier.
 20. The method of claim18 wherein the first group of bits comprises first multiplenon-contiguous portions of the unique mobile station identifier andwherein the second group of bits comprises second multiplenon-contiguous portions of the unique mobile station identifier.